package com.wc.codeforces.思维.Penchick_and_Desert_Rabbit;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 * @Author congge
 * @Date 2024/11/15 21:43
 * @description
 * https://codeforces.com/contest/2031/problem/D
 * 难度很大
 */
public class Main {
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static int N = 500010;
    static int[] a = new int[N], pre = new int[N], suf = new int[N];
    static int[] ans = new int[N];
    static int n;

    public static void main(String[] args) {
        int T = sc.nextInt();
        while (T-- > 0){
            n = sc.nextInt();
            for (int i = 1; i <= n; i++) a[i] = sc.nextInt();
            suf[n + 1] = N;
            pre[1] = 0;
            for (int i = 1; i <= n; i++) pre[i + 1] = Math.max(pre[i], a[i]);
            for (int i = n; i >= 1; i--) suf[i] = Math.min(suf[i + 1], a[i]);
            int last = 0;
            for (int i = 1; i <= n; i++) {
                // 这样说明了什么呢, 我前面的都能跳到 i 这个位置, 然后再跳到前面当前最大值的位置
                if (pre[i + 1] <= suf[i + 1]) {
                    for (int j = last + 1; j <= i; j++){
                        ans[j] = pre[i + 1];
                    }
                    last = i;
                }
            }
            for (int i = 1; i <= n; i++) out.print(ans[i] + " ");
            out.println();
        }
        out.flush();
    }
}

class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    String nextLine() {
        String s = "";
        try {
            s = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    // 是否由下一个
    boolean hasNext() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                String line = br.readLine();
                if (line == null)
                    return false;
                st = new StringTokenizer(line);
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return true;
    }
}

